On Combining the Sweep-Line and Equivalence Method

Analysing Infinite-State Systems by Combining Equivalence Reduction and the Sweep-Line Method

Sweep Line Algorithm for Convex Hull Revisited

Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...

Equivalence Based Cut-off in the Sweep-Line Method

Study on Combining Ability and Gene Effects Estimation in Some Sweet Corn Inbred Lines (Zea mays L. var saccarata) by Line × Tester Method

In breeding programs determination of gene effects and general and specific combining ability for screening of test crosses is necessary. In order to estimate the genetic variance components and the general and specific combining ability of sweet corn lines, an experiment was conducted using 8 sweet corn S6 inbred lines (including 4 maternal and 4 paternal lines) by line × tester mating design ...

Combining the Sweep-Line Method with the Use of an External-Memory Priority Queue

The sweep-line method is an explicit-state model checking technique that uses a notion of progress to delete states from internal memory during state space exploration and thereby reduce peak memory usage. The sweep-line algorithm relies on the use of a priority queue where the progress value assigned to a state determines the priority of the state. In earlier implementations of the sweep-line ...